Generalized GIPSCAL re-revisited: a fast convergent algorithm with acceleration by the minimal polynomial extrapolation

نویسندگان

  • Sébastien Loisel
  • Yoshio Takane
چکیده

Generalized GIPSCAL, like DEDICOM, is a model for the analysis of square asymmetric tables. It is a special case of DEDICOM, but unlike DEDICOM, it ensures the nonnegative definiteness (nnd) of the model matrix, thereby allowing a spatial representation of the asymmetric relationships among “objects”. A fast convergent algorithm was developed for GIPSCAL with acceleration by the minimal polynomial extrapolation. The proposed algorithm was compared with Trendafilov’s algorithm in computational speed. The basic algorithm has been adapted to various extensions of GIPSCAL, including off-diagonal DEDICOM/GIPSCAL, and three-way GIPSCAL.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extrapolation vs. projection methods for linear systems of equations

It is shown that the four vector extrapolation methods, minimal polynomial extrapolation, reduced rank extrapolation, modified minimal polynomial extrapolation, and topological epsilon algorithm, when applied to linearly generated vector sequences, are Krylov subspace methods, and are equivalent to some well known conjugate gradient type methods. A unified recursive method that includes the con...

متن کامل

Shanks Sequence Transformations and Anderson Acceleration

This paper presents a general framework for Shanks transformations of sequences of elements in a vector space. It is shown that the Minimal Polynomial Extrapolation (MPE), the Modified Minimal Polynomial Extrapolation (MMPE), the Reduced Rank Extrapolation (RRE), the Vector Epsilon Algorithm (VEA), the Topological Epsilon Algorithm (TEA), and Anderson Acceleration (AA), which are standard gener...

متن کامل

Analysis of Some Vector Extrapolation Methods for Solving Systems of Linear Equations

In this paper, we consider some vector extrapolation methods for solving nonsymmetric systems of linear equations. When applied to sequences generated linearly, these methods namely the minimal polynomial extrapolation (MPE) and the reduced rank extrapolation (RRE), are Krylov subspaces methods and are respectively equivalent to the method of Arnoldi and to the GCR and GMRES. By considering the...

متن کامل

Fast indirect robust generalized method of moments

The Robust Robust Generalized Methods of Moments (RGMM) and the Indirect Robust GMM (IRGMM) are algorithms for estimating parameter values in statistical models, such as diffusion models for interest rates, in a robust way. The long computation time is one of the main challenge facing these methods. In this paper, we introduce accelerated variants of RGMM and IRGMM. The fixed point iteration in...

متن کامل

Fast Solvers for Thermal Fluid Structure Interaction

We consider thermal fluid structure interaction to model industrial gas quenching in steel forging, where hot steel is cooled using cold high pressured gas. This allows to define properties of the finished steel part, as for example yield strength, locally at low cost and without environmental problems. For the numerical simulation, a partitioned approach via a Dirichlet-Neumann coupling and a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Adv. Data Analysis and Classification

دوره 5  شماره 

صفحات  -

تاریخ انتشار 2011